Decomposition of mathematical programming problems by dynamic programming and its application to block-diagonal geometric programs
نویسندگان
چکیده
منابع مشابه
Solving dynamic stochastic economic models by mathematical programming decomposition methods
Discrete-time optimal control problems arise naturally in many economic problems. Despite the rapid growth in computing power and new developments in the literature, many economic problems are still quite challenging to solve. Economists are aware of the limitations of some of these approaches for solving these problems due to memory and computational requirements. However, many of the economic...
متن کاملGlobal optimization of fractional posynomial geometric programming problems under fuzziness
In this paper we consider a global optimization approach for solving fuzzy fractional posynomial geometric programming problems. The problem of concern involves positive trapezoidal fuzzy numbers in the objective function. For obtaining an optimal solution, Dinkelbach’s algorithm which achieves the optimal solution of the optimization problem by means of solving a sequence of subproblems ...
متن کاملA Mathematical Programming Approach to Stochastic and Dynamic Optimization Problems
We survey a new approach that the author and his co-workers have developed to formulate generic stochastic and dynamic optimization problems as mathematical programming problems. The approach has two components: (a) it produces bounds on the performance of an optimal policy, and (b) it develops techniques to construct optimal or near-optimal policies. The central idea for developing bounds is t...
متن کاملconstruction and validation of translation metacognitive strategy questionnaire and its application to translation quality
like any other learning activity, translation is a problem solving activity which involves executing parallel cognitive processes. the ability to think about these higher processes, plan, organize, monitor and evaluate the most influential executive cognitive processes is what flavell (1975) called “metacognition” which encompasses raising awareness of mental processes as well as using effectiv...
Block-diagonal semidefinite programming hierarchies for 0/1 programming
Lovász and Schrijver, and later Lasserre, proposed hierarchies of semidefinite programming relaxations for 0/1 linear programming problems. We revisit these two constructions and propose two new, blockdiagonal hierarchies, which are at least as strong as the Lovász–Schrijver hierarchy, but less costly to compute. We report experimental results for the stable set problem of Paley graphs. © 2008 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1970
ISSN: 0022-247X
DOI: 10.1016/0022-247x(70)90303-3